Solving Quadratic Assignment Problem with Fixed Assignment (QAPFA) using Branch and Bound Approach
نویسندگان
چکیده
منابع مشابه
Robust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملsolving quadratic assignment problem (qap) using invasive weed optimization algorithm
a new powerful optimization algorithm inspired from colonizing weeds is utilized to solve the well-known quadratic assignment problem (qap) which is of application in a large number of practical areas such as plant layout, machinery layout and so on. a set of reference numerical problems from qaplib is taken in order to evaluate the efficiency of the algorithm compared with the previous ones wh...
متن کاملA hybrid tabu search/branch & bound approach to solving the generalized assignment problem
A number of effective solution methods for the classical Generalised Assignment Problem (GAP) have been proposed during the last thirty years. Exact branch and bound approaches to solving GAP have been proposed by (Ross, Soland 1975, Martello, Toth 1990). More recently however heuristics have been utilised in order to reduce the size of the branch and bound tree by seeking good feasible solutio...
متن کاملSolving A Stochastic Generalized Assignment Problem with Branch and Price
In this chapter, we investigate the generalized assignment problem with the objective of finding a minimum-cost assignment of jobs to agents subject to capacity constraints. A complicating feature of the model is that the coefficients for resource consumption and capacity are random. The problem is formulated as a stochastic integer program with a penalty term associated with the violation of t...
متن کاملA Method for Solving Intuitionistic Fuzzy Assignment Problem Using Branch and Bound Method
In this paper, we investigate an assignment problem in which cost coefficients are triangular intuitionistic fuzzy numbers. In conventional assignment problem, cost is always certain. This paper develops an approach to solve an intuitionistic fuzzy assignment problem where cost is not deterministic numbers but imprecise ones. Here, the elements of the costs (profits) matrix of the assignment pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOP Conference Series: Materials Science and Engineering
سال: 2018
ISSN: 1757-8981,1757-899X
DOI: 10.1088/1757-899x/300/1/012002